Bounded Rationality in Repeated Games∗
نویسنده
چکیده
Models of bounded rationality often lead to sharper predictions about real world outcomes than their full rationality counterparts. Full rationality in repeated interactions allows a plethora of equilibrium outcomes. In this paper, I examine the effect of bounded rationality in infinitely repeated games. In particular, does the introduction of boundedly rational agents lead to a smaller set of outcomes in equilibrium? I show that the number of equilibrium outcomes is smaller when agents are boundedly rational. Importantly, cooperative outcomes are still possible in equilibrium, even when players can’t use sophisticated strategies and are not able to perfectly monitor their opponents. The strategy that leads to cooperation is called “Win-Stay, Lose-Shift”. Using this strategy, I show that cooperation is possible in equilibrium for a large class of 2x2 games. I also give necessary and sufficient conditions on equilibrium structure for twoplayer N ×M games. These conditions suggest that in equilibrium, players must be able to cooperate without getting caught in long periods of conflict. JEL classification: C62,C72,C73
منابع مشابه
Growth of strategy sets, entropy, and nonstationary bounded recall
The paper initiates the study of long term interactions where players’ bounded rationality varies over time. Time dependent bounded rationality is reflected in part in the number ψ(t) of distinct strategies in the first t-stages. We examine how the growth rate of ψi(t) affects equilibrium outcomes of repeated games. An upper bound on the individually rational payoff is derived for a class of tw...
متن کاملBounded Rationality in the Iterated Prisoner’s Dilemma
In diverse fields such as computer science, economics and psychology, bounded rationality has emerged as an important research topic. Models which assume the existence of perfectly rational agents seem inadequate for many realworld problems where agents often lack perfect rationality. Classes of imperfect rationality include the conditions of incomplete knowledge, memory, information or computa...
متن کاملOnline concealed correlation and bounded rationality
Correlation of players’ actions may evolve in the common course of play of a repeated game with perfect monitoring (“online correlation”), and we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose strategic complexity is less stringently bounded, can orchestrate the online correlation of the actions of “weak” players, w...
متن کاملBounded rationality of restricted Turing machines
Bounded rationality aims to understand the effects of how limited rationality affects decisionmaking. The traditional models in game theory and multiagent system research, such as finite automata or unrestricted Turing machine, fall short of capturing how intelligent agents make decision in realistic applications. To address this problem, we model bounded rational agents as restricted Turing ma...
متن کاملBounded Rationality of Restricted Turing Machines
Bounded rationality aims to understand the effects of how limited rationality affects decision-making. The traditional models in game theory and multiagent system research, such as finite automata or unrestricted Turing machine, fall short of capturing how intelligent agents make decision in realistic applications. To address this problem, we model bounded rational agents as restricted Turing m...
متن کامل